Degree sum conditions for vertex-disjoint cycles passing through specified vertices
نویسندگان
چکیده
منابع مشابه
Degree sum conditions and vertex-disjoint cycles in a graph
We consider degree sum conditions and the existence of vertex-disjoint cycles in a graph. In this paper, we prove the following: Suppose that G is a graph of order at least 3k + 2 and σ3(G) ≥ 6k − 2, where k ≥ 2. Then G contains k vertex-disjoint cycles. The degree and order conditions are sharp.
متن کاملEdge disjoint cycles through specified vertices
We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles, each of which contains a prescribed set W of vertices. The condition is that the induced subgraph G[W ] be 2k-connected, and that for any two vertices at distance two in G[W ], at least one of the two has degree at least |V (G)|/2 + 2(k − 1) in G. This is a common generalization of special cases previou...
متن کاملOn vertex-disjoint cycles and degree sum conditions
This paper considers a degree sum condition sufficient to imply the existence of k vertexdisjoint cycles in a graph G. For an integer t ≥ 1, let σt (G) be the smallest sum of degrees of t independent vertices of G. We prove that if G has order at least 7k+1 and σ4(G) ≥ 8k−3, with k ≥ 2, then G contains k vertex-disjoint cycles. We also show that the degree sum condition on σ4(G) is sharp and co...
متن کاملDegree-Sum Conditions for Graphs to Have 2-Factors with Cycles Through Specified Vertices
Let k ≥ 2 and n ≥ 1 be integers, let G be a graph of order n with minimum degree at least k + 1. Let v1, v2, · · · , vk be k distinct vertices of G, and suppose that there exist k vertex disjoint cycles C1, · · · , Ck in G such that vi ∈ V (Ci) for each 1 ≤ i ≤ k. Suppose further that the minimum value of the sum of the degrees of two nonadjacent distinct vertices is greater than or equal to n ...
متن کاملVertex-Disjoint Cycles Containing Specified Vertices in a Graph
Let k ≥ 2 and n ≥ 1 be integers, and let G be a graph of order n with minimum degree at least k + 1 . Let v1, v2, . . . vk be k distinct vertices of G , and suppose that there exist vertex-disjoint cycles C1, C2, . . . , Ck in G such that ∑k i=1 |V (C i)| ≥ 399 100 k and vi ∈ V (Ci) for each 1 ≤ i ≤ k . Suppose further that the minimum value of the sum of the degrees of two nonadjacent distinct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.12.010